Time-Space Label Switching Protocol (TSL-SP)—A New Paradigm of Network Resource Assignment

In this paper we propose a new protocol called time-space label switching protocol (TSL-SP) in optical burst switching (OBS), and define the terms time-space label (TSL) and time-space routing (TSR). An important concept of response time is introduced in the time label mechanism. The TSL-SP is a new technology that can quickly and efficiently forward data with a label on the optical networks. A two-dimension label switched path (TD-LSP) can be set up, that is maintained and deleted by the TSL-SP. For clearly illuminating the operation principles of the TSL-SP, we propose a new approach of orthogonal time-space coordinates in which the vertical coordinate is the space label and the horizontal coordinate is the time label. The proposed TD-LSP can dramatically reduce the routing failure probability and greatly improve the link network efficiency compared with other signaling protocols. Moreover, we define the time-space label control plane that can achieve the higher efficiency. When the TSL-SP is applied to networks, switching performance can be improved by two orders compared to the switching performance with the conventional OBS signaling protocols. The fundamental goal of TSL-SP is to band the signaling and routing functions together closely. Also, the TSL-SP can reduce the complexity of the network, support automatic service offering, and provide traffic engineering.     

Power Management Based Grid Routing Protocol for IEEE 802.11 Based MANET

MANET(Mobile Ad Hoc Network)is a collection of wireless mobile nodes forming a temporary communica-tion network without the aid of any established infrastructure or centralized administration.The lifetime of a MANETdepends on the battery resources of the mobile nodes.So energy consumption may one of important design criterions forMANET.With changing the idle model to sleep model in the grid environment,this paper proposes a new energy-awarerouting protocol.Performance simulation results show that the proposed strategy can dynamic balance the traffic load in-side the whole network,extend the lifetime of a MANET,and without decreasing the throughput ratio.     

Stability analysis of an adaptive packet access scheme for mobile communication systems with high propagation delays

In this paper, we investigate a packet access scheme that is able to support mixed traffics in the presence of high propagation delays. Referring to a Time‐Code Division Multiple Access air interface, we propose a Medium Access Control (MAC) protocol based on a random access scheme. A successful attempt grants the use of a slot‐code resource. This protocol is named Adaptive Time Code‐Packet Reservation Multiple Access (ATC‐PRMA), since the access parameters are changed, depending on the traffic load conditions, so as to fulfil Quality of Service requirements. Numerical examples are carried out for the Low Earth Orbit (LEO)‐Mobile Satellite System (MSS) scenario, but all these considerations could be applied to High‐Altitude Platform Stations (HAPSs) as well. In both cases, high propagation delays prevent an immediate feedback to users. An analytical approach is proposed to study the stability of our MAC scheme. Accordingly, we define a criterion for optimizing system performance. The predicted ATC‐PRMA behaviour is supported by simulation results. Finally, we show the performance improvement of ATC‐PRMA with respect to a MAC protocol not employing adaptive parameters. Copyright © 2003 John Wiley & Sons, Ltd.     

A routing framework for providing robustness to node failures in mobile ad hoc networks

Nodes in a mobile ad hoc network are often vulnerable to failures. The failures could be either due to fading effects, battery drainage, or as a result of compromised nodes that do not participate in network operations. Intermittent node failures can disrupt routing functionalities. As such, it is important to provide redundancy in terms of providing multiple node-disjoint paths from a source to a destination. In line with this objective, we first propose a modified version of the widely studied ad hoc on-demand distance vector routing protocol to facilitate the discovery of multiple node-disjoint paths from a source to a destination. We find that very few of such paths can be found. Furthermore, as distances between sources and destinations increase, bottlenecks inevitably occur and thus, the possibility of finding multiple paths is considerably reduced. We conclude that it is necessary to place what we call reliable nodes (in terms of both being robust to failure and being secure) in the network to support efficient routing operations. We propose a deployment strategy that determines the positions and the trajectories of these reliable nodes such that we can achieve a framework for reliably routing information. We define a notion of a reliable path which is made up of multiple segments, each of which either entirely consists of reliable nodes, or contains a preset number of multiple paths between the end points of the segment. We show that the probability of establishing a reliable path between a random source and destination pair increases tremendously even with a small number of reliable nodes when we use our algorithm to appropriately position these reliable nodes.     

北电网络安全路由技术

北电网络提供的Contivity解决方案不仅可以使用户建立各种类型的VPN，而且还可以把这些VPN集成到未来的融合话音和数据的网络中。该方案已实现了安全路由选择；可通过多种技术支持鉴权功能，从而实现安全接入；允许用户使用其各自的安全性配置文件设置；其设计中没有“后门”，重点介绍了Contivity 2700网关的主要特征及其优势。     

Integrative Cognitive Therapy for Depression: A Preliminary Investigation.

This study is a preliminary investigation of an integrative treatment aimed at improving the efficacy of cognitive therapy (CT) for depression. The development of the treatment protocol was based on process findings, which suggested that strategies used in CT to resolve alliance ruptures may actually exacerbate problems in the therapeutic relationship. The protocol integrates, within the traditional CT treatment manual, procedures to repair alliance ruptures that are derived from or consistent with humanistic and interpersonal therapies. Although conducted by inexperienced therapists, the integrative treatment led to greater improvement than a waiting-list condition. The results also compare favorably to previous findings for CT. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

自治Agents的面向服务的协商模型

提出了一个基于自治Agents的面向服务的协商模型。模型主要包括两大模块：首先定义了一系列的战略和战术过程，使得Agents可以产生初始建议，评价对方的建议，以及在此基础上做出反建议；其次，定义了两个层次的Agent通信机制。二者相辅相成，实现了Agents间合作的动态形成和随机协调，使得Agents可以承担因环境的不确定性而需动态协作的复杂任务。     

通用安全协议分析语言CPAL的研究

本文先从软件理论的角度对安全协议分析语言CPAL的语法和语义进行分析，指出这种语言控制流的缺陷，在语法和语义方面给出CPAL语言的完善方案，并从信息安全中的协议的广泛性方面说明其必要性。     

虚拟绝对式光电编码器的设计和通信方式

介绍了虚拟绝对式光电编码器的位置检测原理以及通过外部倍频电路进一步提高其分辨力的方法,并给出了一种实用的编码器与伺服驱动器之间的串行通信协议设计。     

Compact and localized distributed data structures

This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels , selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.Received: August 2001, Accepted: May 2002, Supported in part by a grant from the Israel Science Foundation.